Postfix automata
نویسندگان
چکیده
منابع مشابه
Unparsing Expressions with Prefix and Postfix Operators
and concrete syntax for infix operators Type rator represents a binary infix operator, which has a text representation, a precedence, and an associativity: hinfixi type precedence = int datatype associativity = LEFT | RIGHT | NONASSOC type rator = string * precedence * associativity This ML code uses simple integers (int) to represent precedence, an enumeration to represent associativity, and a...
متن کاملDeveloping Postfix-GP Framework for Symbolic Regression Problems
This paper describes Postfix-GP system, postfix notation based Genetic Programming (GP), for solving symbolic regression problems. It presents an object-oriented architecture of Postfix-GP framework. It assists the user in understanding of the implementation details of various components of Postfix-GP. Postfix-GP provides graphical user interface which allows user to configure the experiment, t...
متن کاملBreeding Normalized Postfix Expressions for the Facility Layout Problem
This is a preliminary study in which we use a genetic algorithm (GA) to breed normalized postfix expressions for solving the facility layout problem (FLP). Our technique, initially developed for VLSI floorplanning, simultaneously places rectangles onto a planar site and optimizes area utilization by altering the shapes of facilities that have fixed area but flexible height and width dimensions....
متن کاملPseudo Random Postfix Ofdm Based Modulator for next Generation 60ghz Wlans
The IST-2001-32686 project BROADWAY proposes a hybrid dual frequency system operating at 5GHz based on ETSI BRAN HIPERLAN/2 and at 60GHz through an innovative fully ad-hoc extension named HIPERSPOT. In order to allow Single Frequency Network (SFN) deployments at 60GHz while granting compatibility between the two concepts, similar OFDM based physical layers are used with some key improvements fo...
متن کاملBipolar general fuzzy automata
In this paper, we define the notion of a bipolar general fuzzy automaton, then we construct some closure operators on the set of states of a bipolar general fuzzy automaton. Also, we construct some topologies on the set of states of a bipolar general fuzzy automaton. Then we obtain some relationships between them.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.10.050